Distinguishability and identifiability testing of contact state models

نویسندگان

  • Thomas Debus
  • Pierre E. Dupont
  • Robert D. Howe
چکیده

An important component of compliant motion control is the estimation of contact states during task execution. This paper addresses two fundamental questions that must be answered when formulating mathematical descriptions of contact states: are the contact states distinguishable from each other? and can the unknown or imprecisely known parameters in these descriptions be identified? An analytical method is presented for evaluating the distinguishability and identifiability questions of a set of contact state models described by non-linear algebraic equations. In contrast to existing, on-line numerical techniques, this approach can be used during the design phase of a contact state estimator to select contact models and robot sensors to ensure feasibility of the estimator. The approach is illustrated using contacts between polygonal and polyhedral objects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Tools for the Analysis of State Space Models

We present algebraic techniques to analyze state space models in the areas of structural identifiability, observability, and indistinguishability. While the emphasis is on surveying existing algebraic tools for studying ODE systems, we also present a variety of new results. In particular: On structural identifiability, we present a method using linear algebra to find identifiable functions of t...

متن کامل

CRNreals: a toolbox for distinguishability and identifiability analysis of biochemical reaction networks

UNLABELLED Chemical reaction network theory is widely used in modeling and analyzing complex biochemical systems such as metabolic networks and cell signalling pathways. Being able to produce all the biologically and chemically important qualitative dynamical features, chemical reaction networks (CRNs) have attracted significant attention in the systems biology community. It is well-known that ...

متن کامل

DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA

In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...

متن کامل

Polynomial Distinguishability of Timed Automata

We study the complexity of identifying (learning) timed automata in the limit from data. Timed automata are finite state models that model time explicitly, i.e., using numbers. Because timed automata use numbers to represent time, they can be exponentially more compact than models that model time implicitly, i.e., using states. We show three results that are essential in order to exactly determ...

متن کامل

Identifiability of Dynamic Stochastic General Equilibrium Models with Covariance Restrictions

This article is concerned with identification problem of parameters of Dynamic Stochastic General Equilibrium Models with emphasis on structural constraints, so that the number of observable variables is equal to the number of exogenous variables. We derived a set of identifiability conditions and suggested a procedure for a thorough analysis of identification at each point in the parameters sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Advanced Robotics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2005